Implementation of NTRU Algorithm for the Security of N-Tier Architecture
نویسندگان
چکیده
In these days, Security is necessary for all the applications on the network. Number of mechanisms is used for the purpose of providing the security to many applications. But for the N-Tier architecture there is no such type of mechanism is implemented for security till now. N-tier architecture has number of levels or tier, and for each tier security is essential. For providing the security to the data transferred on the network, NTRU algorithm is seen as fast and best algorithm. NTRU is patented and an open source public-key cryptosystem in which lattice-based cryptography system is used for encryption and decryption of files. Many applications make use of extensive databases to store the data and are accessible from anywhere by the multiple people simultaneously via World Wide Web. Applications that use this type of database can be implemented using 3-tier architectural model. There are different types of architectures like 1, 2, 3 or more tier architectures. This paper represents the implementation of the NTRU algorithm for security of such application that is N-tier architecture and showed that this algorithm provides the best security at each tier. The keys generated by the server are used for encryption/decryption of files and encrypted files are stored in the database. This paper focuses on the comparison of proposed work with previous on the basis of parameters like encryption and decryption time, throughput. Keywords— Encryption, Decryption, N-Tier architecture, NTRU, AES, Encryption time, Decryption time
منابع مشابه
Efficiency Improvement for NTRU
The NTRU encryption scheme is an interesting alternative to well-established encryption schemes such as RSA, ElGamal, and ECIES. The security of NTRU relies on the hardness of computing short lattice vectors and thus is a promising candidate for being quantum computer resistant. There has been extensive research on efficient implementation of the NTRU encryption scheme. In this paper, we presen...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملA collusion mitigation scheme for reputation systems
Reputation management systems are in wide-spread use to regulate collaborations in cooperative systems. Collusion is one of the most destructive malicious behaviors in which colluders seek to affect a reputation management system in an unfair manner. Many reputation systems are vulnerable to collusion, and some model-specific mitigation methods are proposed to combat collusion. Detection of col...
متن کاملDifferential Power Analysis: A Serious Threat to FPGA Security
Differential Power Analysis (DPA) implies measuring the supply current of a cipher-circuit in an attempt to uncover part of a cipher key. Cryptographic security gets compromised if the current waveforms obtained correlate with those from a hypothetical power model of the circuit. As FPGAs are becoming integral parts of embedded systems and increasingly popular for cryptographic applications and...
متن کاملPerformance Analysis of Public key Cryptographic Systems RSA and NTRU
In many business sectors secure and efficient data transfer is essential. To ensure the security to the applications of business, the business sectors use Public Key Cryptographic Systems (PKCS). An RSA and NTRU system generally belongs to the category of PKCS. The efficiency of a public key cryptographic system is mainly measured in computational overheads, key size and bandwidth. In particula...
متن کامل